package com.c2b.algorithm.leetcode.base;

/**
 * @author c2b
 * @since 2024/3/13 9:42
 */
public class LC1035 {

    static class Solution {
        public int maxUncrossedLines(int[] nums1, int[] nums2) {
            int n = nums1.length;
            int m = nums2.length;
            int[][] f = new int[n + 1][m + 1];
            for (int i = 1; i <= n; i++) {
                for (int j = 1; j <= m; j++) {

                    if (nums1[i - 1] == nums2[j - 1]) {
                        f[i][j] = Math.max(f[i][j], f[i - 1][j - 1] + 1);
                    } else {
                        f[i][j] = Math.max(f[i - 1][j], f[i][j - 1]);
                    }
                }
            }
            return f[n][m];
        }
    }
}
